Examples of the Generalized Quantum Permanent Compromise Attack to the Blum-Micali Construction
نویسندگان
چکیده
This file contains examples of the generalized quantum permanent compromise attack to the BlumMicali construction. The examples presented here illustrate the attack described in the paper published by Guedes et al. in WECIQ 2010 [3]. To characterize the Blum-Blum-Shub generator, the following references were used: [1, 5, 8, 10] . In the case of the Kaliski generator, the references were: [2, 6, 8, 10]. The reader should consulte them to see more details about these generators.
منابع مشابه
Quantum Permanent Compromise Attack to Blum-Micali Pseudorandom Generator
This paper presents a quantum permanent compromise attack to the Blum-Micali pseudorandom generator whose security is based on the assumption of intractability of the discrete logarithm problem. The proposed attack makes use of the Grover’s quantum search extension for multiple solutions and of quantum parallelism to recover the generator’s internal state with high probability. This attack comp...
متن کاملGENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...
متن کاملBMGL: Synchronous Key-stream Generator with Provable Security (Revision 1)
We propose a construction of an efficient, synchronous keystream generator with provable security properties in response to the NESSIE call for primitives. The cryptographic core of the stream cipher is the block cipher Rijndael. We show that a non-trivial attack on the cipher reduces to an attack on Rijndael. The construction uses an optimization of earlier work on pseudorandom generators by B...
متن کاملA Survey of Pseudorandom Functions
We survey three pseudorandom function constructions – specifically the Goldreich-Goldwasser-Micali construction [3], the Naor-Reingold construction from pseudorandom synthesizers [4], and the canonical NaorReingold number-theoretic constructions from the DDH assumption and the assumption that factoring Blum integers is hard [5].
متن کاملAnalysis and Improving the Security of the Scalar Costa Scheme against Known Message Attack
Unintentional attacks on watermarking schemes lead to degrade the watermarking channel, while intentional attacks try to access the watermarking channel. Therefore, watermarking schemes should be robust and secure against unintentional and intentional attacks respectively. Usual security attack on watermarking schemes is the Known Message Attack (KMA). Most popular watermarking scheme with stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.1776 شماره
صفحات -
تاریخ انتشار 2010